翻訳と辞書 Words near each other ・ Carry the Fire (WorshipMob album) ・ Carry the Ghost ・ Carry the Kettle Nakoda First Nation ・ Carry the Meek ・ Carry the Rainbow on Your Shoulders ・ Carry the Wounded ・ Carry the Zero ・ Carry Us Now ・ Carry van Bruggen ・ Carry You ・ Carry You Home ・ Carry-le-Rouet ・ Carry-lookahead adder ・ Carry-over motions (UK Parliament) ・ Carry-save adder ・ Carry-select adder ・ Carry-skip adder ・ Carryall ・ Carryall Township, Paulding County, Ohio ・ Carrybridge ・ Carryduff ・ Carryduff River ・ Carryer Glacier ・ Carryin' On ・ Carryin' On with Johnny Cash and June Carter ・ Carrying (basketball) ・ Carrying a Torch ・ Carrying capacity ・ Carrying cost ・ Carrying On Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Carry-select adder ： ウィキペディア英語版 Carry-select adder In electronics, a carry-select adder is a particular way to implement an adder, which is a logic element that computes the $(n+1)$-bit sum of two $n$-bit numbers. The carry-select adder is simple but rather fast, having a gate level depth of $O(\backslash sqrt\; n)$. ==Construction== The carry-select adder generally consists of two ripple carry adders and a multiplexer. Adding two n-bit numbers with a carry-select adder is done with two adders (therefore two ripple carry adders) in order to perform the calculation twice, one time with the assumption of the carry being zero and the other assuming one. After the two results are calculated, the correct sum, as well as the correct carry, is then selected with the multiplexer once the correct carry is known. The number of bits in each carry select block can be uniform, or variable. In the uniform case, the optimal delay occurs for a block size of $\backslash lfloor\; \backslash sqrt\; n\; \backslash rfloor$. When variable, the block size should have a delay, from addition inputs A and B to the carry out, equal to that of the multiplexer chain leading into it, so that the carry out is calculated just in time. The $O(\backslash sqrt\; n)$ delay is derived from uniform sizing, where the ideal number of full-adder elements per block is equal to the square root of the number of bits being added, since that will yield an equal number of MUX delays. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Carry-select adder」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.